Classification-tree restructuring methodologies: a new perspective

نویسندگان

  • Tsong Yueh Chen
  • Pak-Lok Poon
  • T. H. Tse
چکیده

The classification-tree method developed by Grochtmann et al. provided a useful approach for constructing test cases from functional specifications. It was automated by Chen and Poon through their tree construction methodology. In a follow-up study, Chen and Poon found that the effectiveness of constructing legitimate test cases could be improved under certain circumstances via a classification-tree restructuring algorithm. In this paper, we develop another tree restructuring algorithm to cater for other situations not covered previously. The two algorithms will complement each other. We also compare the relative effectiveness between these algorithms, and provide guidelines on how to apply them in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification-tree restructuring methodologies: a new perspective - Software, IEE Proceedings- [see also Software Engineering, IEE Proceedings]

The classification-tree method developed by Grochtmann et al. provided a useful approach for constructing test cases from functional specifications. It was automated by Chen and Poou through their tree construction methodology. In a follow-up study, Chen and Poon found that the cffectiveness of constructing lcgitimate test cases could be improved under certain circumstances via a classification...

متن کامل

Title A new restructuring algorithm for the classification-tree method

The classification-tree method developed by Grochtmann and Grimm facilitates the identification of test cases from functional specifications via the construction of classification trees. Their method has been enhanced by Chen and Poon through the classification-tree construction and restructuring methodologies. We find, however, that the restructuring algorithm by Chen and Poon is applicable on...

متن کامل

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Thomas Hardy's Under the Greenwood Tree : An Althusserian Perspective

With the beginning of the 19th century, England entered into a transitional period. Sociologists believe that in each era of transformation, the ruling class tries to establish its own values, but some resistance to these new values is inevitable. Thomas Hardy's novels in general, and Under the Greenwood Tree specifically, are no exception. Based on these notions, this paper tries to interpret ...

متن کامل

Forest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data

Forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. Traditional methods such as field surveys are almost time-consuming and cost-intensive. Improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. This research co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEE Proceedings - Software

دوره 149  شماره 

صفحات  -

تاریخ انتشار 2002